On the Covering and the Additivity Number of the Real Line
نویسندگان
چکیده
We show that the real line R cannot be covered by k many nowhere dense sets iff whenever D = {D¡ : i e k} is a family of dense open sets of R there exists a countable dense set G of R such that \G\D¡\ < co for all i e k. We also show that the union of k meagre sets of the real line is a meagre set iff for every family D = {D¡ : i £ k} of dense open sets of R and for every countable dense set G of R there exists a dense set Q ç G such that \Q\Di\ <w for all i£k. 1. Notation and terminology The notation and terminology which we will use is standard and can be found in [8] or [9]. In particular, if A, B are sets and X any cardinal finite or infinite, then [A]x , [A]<Á , and [A]-À denote the sets of all subsets of A of size X, < X, and < X respectively, co03 denotes the Baire space, i.e., the set of all functions uco together with the topology, having as a base the collection of all (clopen) sets of the form [p] = {f£œco:pçf}, p£co<0J = lJ{nco:n£co}. We say that the family A C [co]03 has the countable n-base property (C7tbp), iff there exists a F g [[ca]Cí,]CÜ, call it a n-base, such that (Va G A)Cyb £ B)(3d £ B)(d Qanb). In order to avoid confusion, let us remark that the notions of orbp and a filter A of [co]01 having a countable base are not the same. B need not be included in A. In fact, B may contain disjoint sets. A ç [co]03 has the strong finite intersection property (sfip), iff | f| Q\ co for every Q £ [A]<(0. We say that a set S £ [co]w is an infinite pseudointersection of the family A ç [co]03 iff (Va G A)(\S\a\ < co). Received by the editors April 1, 1993 and, in revised form, September 10, 1993; presented to the 3rd Greek Conference on Mathematical Analysis held in Ioannina, May 28-29, 1993. 1991 Mathematics Subject Classification. Primary 03E35; Secondary 03E40.
منابع مشابه
A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...
متن کاملAdditivity of maps preserving Jordan $eta_{ast}$-products on $C^{*}$-algebras
Let $mathcal{A}$ and $mathcal{B}$ be two $C^{*}$-algebras such that $mathcal{B}$ is prime. In this paper, we investigate the additivity of maps $Phi$ from $mathcal{A}$ onto $mathcal{B}$ that are bijective, unital and satisfy $Phi(AP+eta PA^{*})=Phi(A)Phi(P)+eta Phi(P)Phi(A)^{*},$ for all $Ainmathcal{A}$ and $Pin{P_{1},I_{mathcal{A}}-P_{1}}$ where $P_{1}$ is a nontrivial projection in $mathcal{A...
متن کاملارائه یک روش ابتکاری ترکیبی مبتنی بر الگوریتم ژنتیک برای حل مسأله هاب پوششی در حالت فازی
Hub location problem is one of the new issues in location problems. This kind of location problem is widely used in many transportation and telecommunication networks. Hubs are facilities that serve as transshipment and switching point to consolidate flows at certain locations for transportation,airline and postal systems so they are vital elements of such these networks. The location and numb...
متن کاملPresenting a three-objective model in location-allocation problems using combinational interval full-ranking and maximal covering with backup model
Covering models have found many applications in a wide variety of real-world problems; nevertheless, some assumptions of covering models are not realistic enough. Accordingly, a general approach would not be able to answer the needs of encountering varied aspects of real-world considerations. Assumptions like the unavailability of servers, uncertainty, and evaluating more factors at the same ti...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملOn-Line Learning of a Persian Spoken Dialogue System Using Real Training Data
The first spoken dialogue system developed for the Persian language is introduced. This is a ticket reservation system with Persian ASR and NLU modules. The focus of the paper is on learning the dialogue management module. In this work, real on-line training data are used during the learning process. For on-line learning, the effect of the variations of discount factor (g) on the learning speed...
متن کامل